An Algorithm for Min Cut Partitioning for Digital Circuit Layout based on Evolutionary Approach
نویسندگان
چکیده
The paper presents a new algorithm for circuit partitioning that exploits some of the latest innovations of evolutionary approaches. The proposed algorithm based on swarm intelligence technique hybrids discrete version of artificial bee colony algorithm with Inver over operator along with simulated annealing technique for local improvement of solution. The algorithm is tested on small UCLA instances and the proposed algorithm outperforms in terms of average runtime for average net cut in comparison to UCLA branch and bound partition. KeywordsArtificial Bee Colony algorithm, Simulated Annealing, Inver-over operator
منابع مشابه
On solving Mincut Balanced Circuit Partitioning Problem for Digital Circuit Layout using Evolutionary Approach with Solution Archive
The interest in finding an optimal partition in the area of VLSI has been a hot issue in recent years. Circuit Partitioning Problem is one of the most studied NP complete problems notable for its broad spectrum of applicability in digital circuit layout. The balanced constraint is an important constraint that obtains an area balanced layout without compromising the mincut objective. This paper ...
متن کاملSoft Computing Approach for digital Circuit Layout based on Graph Partitioning
Soft computing based approaches are increasingly being used to solve different NP complete problems, the development of efficient parallel algorithms for digital circuit partitioning, circuit testing, logic minimization and simulation etc. is currently a field of increasing research activity. This paper describes evolutionary based approach for solving circuitpartitioning problem. That implies ...
متن کاملOptimal fast digital error correction method of pipelined analog to digital converter with DLMS algorithm
In this paper, convergence rate of digital error correction algorithm in correction of capacitor mismatch error and finite and nonlinear gain of Op-Amp has increased significantly by the use of DLMS, an evolutionary search algorithm. To this end, a 16-bit pipelined analog to digital converter was modeled. The obtained digital model is a FIR filter with 16 adjustable weights. To adjust weights o...
متن کاملCircuit Partitioning using High Level Design Information
2 PARTITIONING APPROACHES Partitioning digital circuits has become a key problem in the Computer Aided Engineering area during the last years. Design benefits of new technologies like MultiChip-Module designs or logic emulation strongly depends on partitioning results. Most published approaches are based on abstract graph models constructed from flat netlists, thus taking only connectivity info...
متن کاملPar-POPINS: a timing-driven parallel placement method with the Elmore delay model for row based VLSIs
In this paper, we present a parallel algorithm running on a shared memory multi-processor workstation for timing driven standard cell layout. The proposed algorithm is based on POPINS2.0 [13] and consists of three phases. First, we get an initial placement by a hierarchical timing-driven mincut placement algorithm. At the top level of partitioning hierarchy, we perform one step of bi-partitioni...
متن کامل